Performance Analysis of Test Data Generation for Path Coverage Based Testing Using Three Meta- Heuristic Algorithms
نویسندگان
چکیده
This paper discusses an approach to generate test data for path coverage based testing using Genetic Algorithms, Differential Evolution and Artificial Bee Colony optimization algorithms. Control flow graph and cyclomatic complexity of the example program has been used to find out the number of feasible paths present in the program and it is compared with the actual no of paths covered by the evolved test cases using those meta-heuristic algorithms. Genetic Algorithms, Artificial Bee Colony optimization and Differential Evolution are acting here as meta-heuristic search paradisms for path coverage based test data generation. Finally the performance of the test data generation using three meta-heuristic optimization algorithms are empirically evaluated and compared. KeywordsGenetic Algorithms(GA), Differential Evolu-tion(DE), Artificial Bee Colony Algorithm(ABC), Path Cover-age Based Testing, Cyclomatic Complexity,Software test data generator.
منابع مشابه
Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملEmpirical Evaluation of Metaheuristic Approaches for Symbolic Execution based Automated Test Generation
This paper empirically evaluates four meta-heuristic search techniques namely particle swarm optimization, artificial bee colony algorithm, Genetic Algorithm and Big Bang Big Crunch Algorithm for automatic test data generation for procedure oriented programs using structural symbolic testing method. Test data is generated for each feasible path of the programs. Experiments on ten benchmark prog...
متن کاملUsing the Particle Swarm Optimization Algorithm to Generate the Minimum Test Suite in Covering Array with Uniform Strength
Up to now, several useful algorithms have been proposed to generate covering array, which is one of the branches of combinatorial testing. The main challenge in generating such arrays is generation of the arrays with a minimum number of test cases (for efficiency) at a proper time (for performance), for large systems. Covering array generation strategies are often divided into two general categ...
متن کاملTesting Soccer League Competition Algorithm in Comparison with Ten Popular Meta-heuristic Algorithms for Sizing Optimization of Truss Structures
Recently, many meta-heuristic algorithms are proposed for optimization of various problems. Some of them originally are presented for continuous optimization problems and some others are just applicable for discrete ones. In the literature, sizing optimization of truss structures is one of the discrete optimization problems which is solved by many meta-heuristic algorithms. In this paper, in or...
متن کاملComparison of Portfolio Optimization for Investors at Different Levels of Investors' Risk Aversion in Tehran Stock Exchange with Meta-Heuristic Algorithms
The gaining returns in line with risks is always a major concern for market play-ers. This study compared the selection of stock portfolios based on the strategy of buying and retaining winning stocks and the purchase strategy based on the level of investment risks. In this study, the two-step optimization algorithms NSGA-II and SPEA-II were used to optimize the stock portfolios. In order to de...
متن کامل